Metaqueries: Semantics, complexity, and efficient algorithms
نویسندگان
چکیده
منابع مشابه
Metaqueries: Semantics, complexity, and efficient algorithms
Metaquery (metapattern) is a data mining tool which is useful for learning rules involving more than one relation in the database. The notion of a metaquery has been proposed as a template or a second-order proposition in a language L that describes the type of pattern to be discovered. This tool has already been successfully applied to several real-world applications. In this paper we advance ...
متن کاملCollaborative Clustering: Sample Complexity and Efficient Algorithms
We study the problem of collaborative clustering. This problem is concerned with a set of items grouped into clusters that we wish to recover from ratings provided by users. The latter are also clustered, and each user rates a random but typical small number of items. The observed ratings are random variables whose distributions depend on the item and user clusters only. Unlike for collaborativ...
متن کاملEfficient algorithms in quantum query complexity
In this thesis we provide new upper and lower bounds on the quantum query complexity of a diverse set of problems. Specifically, we study quantum algorithms for Hamiltonian simulation, matrix multiplication, oracle identification, and graph-property recognition. For the Hamiltonian simulation problem, we provide a quantum algorithm with query complexity sublogarithmic in the inverse error, an e...
متن کاملMetaqueries for Data Mining
This chapter presents a framework that uses metaqueries to integrate inductive learning methods with deductive database technologies in the context of knowledge discovery from databases. Metaqueries are second-order predicates or templates, and are used for (1) Guiding deductive data collection, (2) Focusing attention for inductive learning, and (3) Assisting human analysts in the discovery loo...
متن کاملEfficient Scalable Image Compression Algorithms with Low Memory and Complexity
The set partitioning embedded block (SPECK) image compression algorithm has excellent performance, low computational complexity, and produces a rate scalable compressed bitstream that can be decoded efficiently at multiple bit-rates. Unfortunately, it consumes a huge amount of computer memory due to employing lists that store the coordinates of the image pixels and the coordinates of the sets t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2003
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(03)00073-0